Diversity versus Channel Knowledge at Finite Block- Length Citation
نویسندگان
چکیده
We study the maximal achievable rate R∗(n, ) for a given block-length n and block error probability over Rayleigh block-fading channels in the noncoherent setting and in the finite block-length regime. Our results show that for a given blocklength and error probability, R∗(n, ) is not monotonic in the channel’s coherence time, but there exists a rate maximizing coherence time that optimally trades between diversity and cost of estimating the channel.
منابع مشابه
Diversity-Multiplexing Tradeoff in the Multiaccess Relay Channel with Finite Block Length
The Dynamic Decode-and-Forward (DDF) protocol and the Hybrid DDF and Amplified-and-Forward (HDAF) protocol for the multiple-access relay channel (MARC) with quasi static fading are evaluated using the Zheng-Tse diversity-multiplexing tradeoff (DMT). We assume that there are two users, one half-duplex relay, and a common destination, each equipped with single antenna. For the Rayleigh fading, th...
متن کاملDirection-time transmission for fast fading vector channel
Transmit diversity and space-time coding have received a lot of attention in recent years. In this paper, we propose a direction-time transmit scheme for a fast block fading channel which exploits the parametric structure of the time-varing vector channel. Specular propagation and local scattering are assumed at the base-station and mobile station respectively. The partial channel knowledge nee...
متن کاملReview of Single Carrier FDE Performance Enhancement Techniques
Single-carrier (SC) block transmission with cyclic prefix (CP) has several advantages that has been seen in this paper. The aim of this paper to improved the performance of SC-FDE multi-antenna SC-FDE by using cyclic-delay diversity (CDD) and Alamouti signaling. Analysis characterizes the diversity, it shows that diversity depends on the antenna configuration, channel memory, data block length ...
متن کاملNested input-constrained codes
constrained systems, deterministic encoders, finite-state encoders, input-constrained channels, nested encoders An input-constrained channel, or simply a constraint, is a set of S of words that is generated by a finite labeled directed graph. In the context of coding, the study of constraints mainly aims at designing encoders that map unconstrained input words into words of S in a lossless mann...
متن کاملX-Network with three antennas
Interference alignment is known to achieve the maximum sum DoF of 4M 3 in the 2 × 2 X-Network (i.e., twotransmitter (Tx) two-receiver (Rx) X-Network) with M antennas at each node, as demonstrated by Jafar and Shamai. Recently, an Alamouti code based transmission scheme, which we call the Li-Jafarkhani-Jafar (LJJ) scheme, was proposed for the 2×2 XNetwork with two antennas at each node. This sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012